869. Reordered Power of 2 - LeetCode Solution


Math sorting counting

Python Code:

class Solution:
    def reorderedPowerOf2(self, n: int) -> bool:
        for i in range(32):
            dict1 = {}
            
            
            binary = str(2**i)
            if len(binary) != len(str(n)):
                continue
            for digit in binary:
                if digit in dict1:
                    dict1[digit]+=1
                else:
                    dict1[digit] = 1
            dict2 = {}
            for digit in str(n):
                if digit in dict2:
                    dict2[digit] +=1
                else:
                    dict2[digit] = 1
        
            if dict1 == dict2:
                return True
        return False


Comments

Submit
0 Comments
More Questions

230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock
205A - Little Elephant and Rozdil
1609B - William the Vigilant
978B - File Name
1426B - Symmetric Matrix